Recursive Path Orderings Can Also Be Incremental
نویسندگان
چکیده
In this paper the Recursive Path Ordering is adapted for proving termination of rewriting incrementally. The new ordering, called Recursive Path Ordering with Modules, has as ingredients not only a precedence but also an underlying ordering =B. It can be used for incremental (innermost) termination proofs of hierarchical unions by defining =B as an extension of the termination proof obtained for the base system. Furthermore, there are practical situations in which such proofs can
منابع مشابه
On the Complexity of Recursive Path Orderings
Well-founded orderings on terms are useful in a variety of contexts in computer science, not only in simply proving the termination of equationally defined algorithms, but also in automated deduction, for example in restrictions of paramodulation [2,6] and in rewriting systems (for an excellent survey on orderings and their use in rewriting see [4]). In these settings, decision procedures for v...
متن کاملOrderings for Innermost Termination
This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity , IP-monotonicity for short. This property may lead to several innermost-specific orderings. Here, an IP-monotonic version of the Recursive Path Ordering is presented. This variant can be used (directly or as ingredient of the Dependency Pairs method) for provi...
متن کاملTermination Proofs for Term Rewriting Systems by Lexicographic Path Orderings Imply Multiply Recursive Derivation Lengths
It is shown that a termination proof for a term rewriting system using a lexicographic path ordering yields a multiply recursive bound on the length of derivations, measured in the depth of the starting term. This result is essentially optimal since for every multiply recursive function f a rewrite system (which reduces under the lexicographic path ordering) can be found such that its derivatio...
متن کاملThe recursive path and polynomial ordering for first-order and higher-order terms
In most termination tools two ingredients, namely recursive path orderings (RPO) and polynomial interpretation orderings (POLO), are used in a consecutive disjoint way to solve the final constraints generated from the termination problem. In this paper we present a simple ordering that combines both RPO and POLO and defines a family of orderings that includes both, and extend them with the poss...
متن کاملXQuery Translation to Sem-SQL
XML query translation is an inevitable step involved in using non-XML databases storing XML data. In this paper, we address the XQuery to Sem-SQL translation issue, part of the XML storage and retrieval using the Semantic Binary Object-Oriented Database System (Sem-ODB) project, by providing a high-level description of the translation scheme between XQuery and Sem-SQL. Our translation scheme ut...
متن کامل